package demo1;

import java.util.Scanner;

public class NowCoderDP35 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt(), m = in.nextInt(), q = in.nextInt();
        int[][] arr = new int[n + 1][m + 1];
        long[][] dp = new long[n + 1][m + 1];
        for (int i = 1; i < n + 1; i++) {
            for (int j = 1; j < m + 1; j++) {
                arr[i][j] = in.nextInt();
            }
        }
        for (int i = 1; i < n + 1; i++) {
            for (int j = 1; j < m + 1; j++) {
                dp[i][j] = dp[i][j -1] + dp[i - 1][j] - dp[i - 1][j - 1] + arr[i][j];
            }
        }
        while (q > 0) {
            int a = in.nextInt(), b = in.nextInt(),
                    c = in.nextInt(), d = in.nextInt();
            System.out.println(dp[c][d] + dp[a - 1][b - 1] - dp[c][b - 1] - dp[a - 1][d]);
            q--;
        }
    }
}
